A Constant-Factor Approximation Algorithm for thek-MST Problem
نویسندگان
چکیده
منابع مشابه
A Constant-Factor Approximation Algorithm for k-MST Problem
Given an undirected graph with nonnegative edge costs and an integer k, the k-MST problem is that of finding a tree of minimum cost on k nodes. This problem is known to be NP-hard. We present a simple approximation algorithm that finds a solution whose cost is less than 17 times the cost of the optimum. This improves upon previous performance ratios for this problem &O(k) due to Ravi et al., O(...
متن کاملA Constant-Factor Approximation Algorithm for the k-MST Problem
Given an undirected graph with non negative edge costs and an inte ger k the k MST problem is that of nding a tree of minimum cost on k nodes This problem is known to be NP hard We present a simple approximation algorithm that nds a solution whose cost is less than times the cost of the optimum This improves upon previous performance ratios for this problem O p k due to Ravi et al O log k due t...
متن کاملA Constant-Factor Approximation Algorithm for the Geometric k-MST Problem in the Plane
We show that any rectilinear polygonal subdivision in the plane can be converted into a “guillotine” subdivision whose length is at most twice that of the original subdivision. “Guillotine” subdivisions have a simple recursive structure that allows one to search for “optimal” such subdivisions in polynomial time, using dynamic programming. In particular, a consequence of our main theorem is a v...
متن کاملA 2.5-Factor Approximation Algorithm for the k-MST Problem
The k-MST problem requires finding that subset of at least k vertices of a given graph whose Minimum Spanning Tree has least weight amongst all subsets of at least k vertices. There has been much work on this problem recently, culminating in an approximation algorithm by Garg [2], which finds a subset of k vertices whose MST has weight at most 3 times the optimal. Garg also argued that a factor...
متن کاملA constant-factor approximation algorithm for the k-median problem
We present the first constant-factor approximation algorithm for the metric k-median problem. The k-median problem is one of the most well-studied clustering problems, i.e., those problems in which the aim is to partition a given set of points into clusters so that the points within a cluster are relatively close with respect to some measure. For the metric k-median problem, we are given n poin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 1999
ISSN: 0022-0000
DOI: 10.1006/jcss.1997.1542